The Proof of Completeness of the Graph Method for Generation of Affine Moment Invariants

نویسنده

  • Tomás Suk
چکیده

Features for recognition of affinely distorted objects are of great demand. The affine moment invariants can be generated by a few methods, namely the graph method, the tensor method and the direct solution of the Cayley-Aronhold differential equation. The proof of their equivalence is complicated; it can be derived from the Gurevich’s proof for affine tensor invariants. The theme of this paper is this derivation.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Face Recognition using an Affine Sparse Coding approach

Sparse coding is an unsupervised method which learns a set of over-complete bases to represent data such as image and video. Sparse coding has increasing attraction for image classification applications in recent years. But in the cases where we have some similar images from different classes, such as face recognition applications, different images may be classified into the same class, and hen...

متن کامل

Tensor Method for Constructing 3D Moment Invariants

A generalization from 2D to 3D of the tensor method for derivation of both affine invariants and rotation, translation and scaling (TRS) invariants is described. The method for generation of the 3D TRS invariants of higher orders is automated and experimentally tested.

متن کامل

Naturally combined shape-color moment invariants under affine transformations

We proposed a kind of naturally combined shape-color affine moment invariants (SCAMI), which consider both shape and color affine transformations simultaneously in one single system. In the real scene, color and shape deformations always exist in images simultaneously. Simple shape invariants or color invariants can not be qualified for this situation. The conventional method is just to make a ...

متن کامل

Splice Graphs and their Vertex-Degree-Based Invariants

Let G_1 and G_2 be simple connected graphs with disjoint vertex sets V(G_1) and V(G_2), respectively. For given vertices a_1in V(G_1) and a_2in V(G_2), a splice of G_1 and G_2 by vertices a_1 and a_2 is defined by identifying the vertices a_1 and a_2 in the union of G_1 and G_2. In this paper, we present exact formulas for computing some vertex-degree-based graph invariants of splice of graphs.

متن کامل

Adaptive Consensus Control for a Class of Non-affine MIMO Strict-Feedback Multi-Agent Systems with Time Delay

In this paper, the design of a distributed adaptive controller for a class of unknown non-affine MIMO strict-feedback multi agent systems with time delay has been performed under a directed graph. The controller design is based on dynamic surface control  method. In the design process, radial basis function neural networks (RBFNNs) were employed to approximate the unknown nonlinear functions. S...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010